SERIE RESEARCH mEIÏIORnnDU PRODUCT FORMS FOR RANDOM ACCESS SCHEMES
نویسنده
چکیده
A framework is presented to investigate product form expres sions for circuit or packet switching random access protocols such as multihop-CSMA. Acceptation, retransmission and delay or acceleration functions are included. The transmission times and packet lenghts are generally distributed. A concrete invariance condition on the system functions is given which guarantëes an insensitive product form. This condition unifies and extends known results. Several new examples are obtained. In particular, recently derived product form expressions for multihop-CSMA protocols are generalized.
منابع مشابه
SERIE RESEARCH mEmORMlDfl PRODUCT FORMS FOR QUEUEING NETWORKS WITH STATE DEPENDENT MULTIPLE JOB TRANSITIONS
متن کامل
SERIE RE5EHRCH mEmORMlDII PRODUCT FORMS FOR QUEUEING NETWORKS WITH LIMITED CLUSTERS
Queueing networks are considered with limited station clusters. A general characterization is given, in terms of local solutions of state dependent traffic equations, from which the existence and structure of a product form can be concluded. This characterization leads to new product form examples such as with a weak reversible cluster routing or a non-reversible routing both within and in betw...
متن کاملBiochemical Indices in Ecology: A Catalyst in Environmental Study
Volume 5 • Issue 1 • 1000239 Biochem Anal Biochem ISSN: 2161-1009 Biochem, an open access journal *Corresponding author: Marwa Muhammad Abu-Serie, Medical Biotechnology Department, Genetic Engineering and Biotechnology Research Institute, City for Scientific Research and Technology Applications (SRTA-City), New Borg El Arab, Alexandria, Egypt, Tel: +2034593422; Fax: +2034593407; E-mail: marwael...
متن کاملEfficient Constructions for t- (k, n)*-Random Grid Visual Cryptographic Schemes
In this paper we consider both “OR” and “XOR” based monochrome random grid visual cryptographic schemes (RGVCS) for t-(k, n)∗ access structure which is a generalization of the threshold (k, n) access structure in the sense that in all the successful attempts to recover the secret image, the t essential participants must always be present, i.e., a group of k or more participants can get back the...
متن کاملDynamic random channel allocation scheme in HIPERLAN type 2
The need for wireless high speed data transmission is increasing. HiperLAN type 2 is an ETSI broadband wireless access network standard operating in license-exempt 5GHz band. The MAC protocol of HiperLAN type 2 is based on TDMA/TDD and resources in one MAC frame can be allocated dynamically by Access Point(AP). In this paper, we propose a dynamic random channel allocation scheme for HiperLAN ty...
متن کامل